Real Hypercomputation and Continuity
نویسندگان
چکیده
منابع مشابه
Real Hypercomputation and Degrees of Discontinuity
By the sometimes so-called Main Theorem of Recursive Analysis, every computable real function is necessarily continuous. Weihrauch and Zheng (TCS 2000), Brattka (MLQ2005), and Ziegler (ToCS 2006) have considered different relaxed notions of computability to cover also discontinuous functions. The present work compares and unifies these approaches. This is based on the concept of the jump of a r...
متن کاملReal Hypercomputation with Infinite Oracle Queries
We define Oracle-Type-2-Machine capable of writing infinite oracle queries. In contrast to finite oracle queries, this extends the realm of oracle-computable function into the discontinuous realm. Our definition is conservative; access to a computable oracle does not increase the computational power. Other models of real hypercomputation such as Ziegler’s (finitely) revising computation ([4], [...
متن کاملNew Physics and Hypercomputation
Does new physics give us a chance for designing computers, at least in principle, which could compute beyond the Turing barrier? By the latter we mean computers which could compute some functions which are not Turing computable. Part of what we call “new physics” is the surge of results in black hole physics in the last 15 years, which certainly changed our perspective on certain things. The tw...
متن کاملZeno machines and hypercomputation
This paper reviews the Church-Turing Thesis (or rather, theses) with reference to their origin and application and considers some models of “hypercomputation”, concentrating on perhaps the most straight-forward option: Zeno machines (Turing machines with accelerating clock). The halting problem is briefly discussed in a general context and the suggestion that it is an inevitable companion of an...
متن کاملar X iv : c s / 05 08 06 9 v 1 [ cs . L O ] 1 5 A ug 2 00 5 Real Hypercomputation and Continuity ⋆
By the sometimes so-called Main Theorem of Recursive Analysis, every computable real function is necessarily continuous. We wonder whether and which kinds of hypercomputation allow for the effective evaluation of also discontinuous f : R → R. More precisely the present work considers the following three super-Turing notions of real function computability: – relativized computation; specifically...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2007
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-006-1343-6